Optimizing Object-Oriented Collection Join Queries through Path Traversals
نویسنده
چکیده
Path traversals have been recognized as one of the strengths of object-oriented query processing as object retrieval can be carried out through pointer navigation. Apart from path traversals, explicit join between objects is sometimes necessary in Object-Oriented Databases (OODB), due to the absence of pointer connections or the need for value matching between objects. Like in Relational Databases (RDBMS), join operations are still, if not more, expensive in OODB. In this paper, we propose an optimization strategy for object-oriented collection join queries through the use of path traversals. Our performance evaluation shows that optimization of collection join queries gains some performance benefits.
منابع مشابه
Cost-Controlled OFL Rewriting Rules for Multiple Collection Traversals
The integration of path expression evaluations in an object-oriented cost-driven query optimizer is the subject of this paper. We present rewriting rules that transform path expressions into different object target programs (i.e., query execution plans). An analytical cost model is presented and used to compare the quality of various programs. We have used the OFL (Object Functional Language) t...
متن کاملParallel Sub-Collection Join Algorithm for High Performance Object-Oriented Databases
In Object-Oriented Databases (OODB), although path expression between classes may exist, it is sometimes necessary to perform an explicit join between two or more classes due to the absence of pointer connections or the need for value matching between objects. Furthermore, since objects are not in a normal form, an attribute of a class may have a collection as a domain. Collection attributes ar...
متن کاملDesign and Implementation of an Object-Oriented SQL Query Processor with an Optimizer
A SQL-like object-oriented query language is implemented on Exodus Storage Manager with an original query optimization strategy based on the object-oriented features of the language. For this purpose the selectivity of a path expression, cost of forward and backward traversals are calculated, and join sizes are estimated. An original strategy is developed for choosing the order of selections an...
متن کاملA Join Algorithm Utilizing Multiple Path Indexes in Object-Oriented Database Systems
Although various types of path indexes – indexes on path expressions – have been proposed for efficient processing of object-oriented queries, conventional join algorithms do not effectively utilize them. We propose a new join algorithm called OID join algorithm that effectively utilizes (multiple) path indexes in object-oriented databases. When (multiple) path indexes are available for a query...
متن کاملCollection-Intersect Join Algorithms for Parallel Object-Oriented Database Systems
One of the differences between relational and object-oriented databases (OODB) is that attributes in OODB can of a collection type (e.g. sets, lists, arrays, bags) as well as a simple type (e.g. integer, string). Consequently, explicit join queries in OODB may be based on collection attributes. One form of collection join queries in OODB is collectionintersect join queries, where the joins are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999